منابع مشابه
Slot Index Spatial Join
Efficient processing of spatial joins is very important due to their high cost and frequent application in spatial databases and other areas involving multidimensional data. This paper proposes slot index spatial join (SISJ), an algorithm that joins a nonindexed data set with one indexed by an R-tree. We explore two optimization techniques that reduce the space requirements and the computationa...
متن کاملEfficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for data sets which are updated infrequently. The I/O cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given ...
متن کاملSummary of Revision Title: Eecient Join-index-based Spatial-join Processing: a Clustering Approach
Comment: What are the complexities of the proposed algorithms (such as SC)? Response: We have added text summarizing an analysis of the computational complexity. This text appears in Section 2.2 (last paragraph) and Section 4.4 (last paragraph), and is reproduced in Appendix A of this document. We also added additional text and gure in the \Scope" (Section 1.3) to show the diierence between spa...
متن کاملOptimizing Join Index Based Spatial-Join Processing: A Graph Partitioning Approach
A Join Index is a data structure that optimizes the join query processing in spatial databases. Join indices use pre-computation techniques to speed up online query processing and are useful for applications which require low update rates. The cost of spatial join computation using a join-index with limited buuer space depends primarily on the page access sequence used to fetch the pages of the...
متن کاملSpatial Join
DEFINITION Spatial join operation is used to combine two or more datasets with respect to a spatial predicate. The predicate can be a combination of directional, distance, and topological spatial relations. In the case of nonspatial joins, the joining attributes must be of the same type, but for spatial joins they can be of different types. Usually each spatial attribute is represented by its m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2003
ISSN: 1041-4347
DOI: 10.1109/tkde.2003.1161591